null
(Ed.)
Supply energy to battery-powered sensor devices by deploying wireless chargers is a promising way to prolong the operation time
of wireless sensor networks, and has attracted much attention recently.
Existing works focus on maximizing the total received charging power of
the network. However, this may face the unbalanced energy allocation
problem, which is not beneficial to prolong the operation time of wireless sensor networks. In this paper, we consider the individual energy
requirement of each sensor node, and study the problem of minimum
charger placement. That is, we focus on finding a strategy for placing
wireless chargers from a given candidate location set, such that each
sensor node’s energy requirement can be met, meanwhile the total number of used chargers can be minimized. We show that the problem to
be solved is NP-hard, and present two approximation algorithms which
are based on the greedy scheme and relax rounding scheme, respectively.
We prove that both of the two algorithms have performance guarantees.
Finally, we validate the performance of our algorithms by performing
extensive numerical simulations. Simulation results show the effectiveness of our proposed algorithms
more »
« less
